Two row mixed-integer cuts via lifting
نویسندگان
چکیده
منابع مشابه
Two row mixed-integer cuts via lifting
Recently Andersen et al. [1], Borozan and Cornuéjols [6] and Cornuéjols and Margot [10] have characterized the extreme valid inequalities of a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal lattice-free convex sets. In order to use these inequ...
متن کاملA Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs
We provide a probabilistic comparison of split and type 1 triangle cuts for mixed-integer programs with two rows and two integer variables in terms of cut coefficients and volume cut off. Under a specific probabilistic model of the problem parameters, we show that for the above measure, the probability that a split cut is better than a type 1 triangle cut is higher than the probability that a t...
متن کاملConic mixed-integer rounding cuts
A conic integer program is an integer programming problem with conic constraints.Manyproblems infinance, engineering, statistical learning, andprobabilistic optimization aremodeled using conic constraints. Herewe studymixed-integer sets definedby second-order conic constraints.We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second...
متن کاملNumerically Safe Gomory Mixed-Integer Cuts
W describe a simple process for generating numerically safe cutting planes using floating-point arithmetic and the mixed-integer rounding procedure. Applying this method to the rows of the simplex tableau permits the generation of Gomory mixed-integer cuts that are guaranteed to be satisfied by all feasible solutions to a mixed-integer programming problem (MIP). We report on tests with the MIPL...
متن کاملFoundation-penalty cuts for mixed-integer programs
We propose a new class of Foundation-Penalty (FP) cuts for GUB-constrained (and ordinary) mixed-integer programs, which are easy to generate by exploiting standard penalty calculations that are routinely employed in branch-and-bound contexts. The FP cuts are derived with reference to a selected integer variable or GUB set, and a foundation function that is typically a reduced cost function corr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2010
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-010-0362-x